On maximum-sum matchings of points

Abstract Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets R and B with $$|R|=|B|$$ | R = B , the perfect matching matches points of maximizes total squared Euclidean distance matched pairs, has property all disks induced by have a common point. Each pair $$p\in R$$ p ∈ $$q\in B$$ q induces disk smallest diameter covers p q . Following this research line, in paper we consider distance. First, prove new does not always ensure intersection disks. Second, extend study 2 n uncolored plane, where is just partition into pairs. As main result, case do